Quality recovering of university timetables

Building University Timetables Using Constraint Logic Programming

Optimal University Course Timetables and the Partial Transversal Polytope

University course timetabling is the conflict-free assignment of courses to weekly time slots and rooms subject to various hard and soft constraints. One goal is to meet as closely as possible professors’ preferences. Building on an intuitive integer program (IP), we develop an exact decomposition approach which schedules courses first, and matches courses/times to rooms in a second stage. The ...

An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables

In this paper, we present an investigation into using fuzzy methodologies to guide the construction of high quality feasible examination timetabling solutions. The provision of automated solutions to the examination timetabling problem is achieved through a combination of construction and improvement. The enhancement of solutions through the use of techniques such as metaheuristics is, in some ...

Genetic Improvement of Railway Timetables

We consider how to improve railway timetables. As case we take the Rompnet of the dutch railways, a highly constrained problem, containing both hard and soft constraints. We show how to cast the constraints into the format of the Genocop system. Every train should run every hour at the same time and hence the constraints should be interpreted modulo sixty. This gives a non-convex search space o...

A Case-Based Reasoning Approach to Formulating University Timetables Using Genetic Algorithms

This paper presents a technique to construct generic university timetables using case-based reasoning (CBR) with genetic algorithms (GAs). The case-based reasoning methodology allows a past memory of timetables to be stored and accessed via retrieval mechanisms, finding a past solution most fitting to the new timetable input problem. In the instance that a past solution is not well suited to th...